Differential Sensitivity Analysis for Convex Programming Problem
نویسندگان
چکیده
منابع مشابه
Sensitivity analysis in convex programming
The object of this paper is to perform an analysis of the sensitivity for convex vector programs with inequality constraints by examining the quantitative behavior of a certain set of optima according to changes of right-hand side parameters included in the program. The results in the paper prove that the sensitivity of the program depends on the solution of a dual program and its sensitivity. ...
متن کاملSensitivity analysis in multiobjective differential programming
1. I N T R O D U C T I O N The main objective of the present article is to analyze sensitivity in vectorial optimization programs, that is, to study the variations of a set of efficient points when a certain parameter of the program varies. There is a very important fact that marks an essential difference between scalar and vectorial programming. Whereas in the case of scalar programming the op...
متن کاملA Method for Solving Convex Quadratic Programming Problems Based on Differential-algebraic equations
In this paper, a new model based on differential-algebraic equations(DAEs) for solving convex quadratic programming(CQP) problems is proposed. It is proved that the new approach is guaranteed to generate optimal solutions for this class of optimization problems. This paper also shows that the conventional interior point methods for solving (CQP) problems can be viewed as a special case of the n...
متن کاملThe KKT optimality conditions for constrained programming problem with generalized convex fuzzy mappings
The aim of present paper is to study a constrained programming with generalized $alpha-$univex fuzzy mappings. In this paper we introduce the concepts of $alpha-$univex, $alpha-$preunivex, pseudo $alpha-$univex and $alpha-$unicave fuzzy mappings, and we discover that $alpha-$univex fuzzy mappings are more general than univex fuzzy mappings. Then, we discuss the relationships of generalized $alp...
متن کاملPareto Optimal Solution Analysis of Convex Multi-Objective Programming Problem
The main method of solving multi-objective programming is changing multi-objective programming problem into single objective programming problem, and then get Pareto optimal solution. Conversely, whether all Pareto optimal solutions can be obtained through appropriate method, generally the answer is negative. In this paper, the methods of norm ideal point and membership function are used to sol...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the Society of Instrument and Control Engineers
سال: 1987
ISSN: 0453-4654
DOI: 10.9746/sicetr1965.23.1312